Finite 2-arc-transitive abelian Cayley graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

5-Arc transitive cubic Cayley graphs on finite simple groups

In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finite nonbelian simple groups, and so this paper completes the classification of such non-normal Cayley graphs.

متن کامل

Arc { Transitive Non { Cayley Graphs from Regular

We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r 3 and p is a prime greater than r(r ? 1).

متن کامل

On 2-arc-transitive Cayley Graphs of Dihedral Groups

Slovenija Abstract A partial extension of the results in 1], where 2-arc-transitive cir-culants are classiied, is given. It is proved that a 2-arc-transitive Cayley graph of a dihedral group is either a complete graph or a bi-partite graph.

متن کامل

FINITE s-ARC TRANSITIVE CAYLEY GRAPHS AND FLAG-TRANSITIVE PROJECTIVE PLANES

In this paper, a characterisation is given of finite s-arc transitive Cayley graphs with s ≥ 2. In particular, it is shown that, for any given integer k with k ≥ 3 and k 6= 7, there exists a finite set (maybe empty) of s-transitive Cayley graphs with s ∈ {3, 4, 5, 7} such that all s-transitive Cayley graphs of valency k are their normal covers. This indicates that s-arc transitive Cayley graphs...

متن کامل

Arc-transitive and s-regular Cayley graphs of valency 5 on Abelian groups

Let G be a finite group, and let 1G 6∈ S ⊆ G. A Cayley di-graph Γ = Cay(G,S) of G relative to S is a di-graph with a vertex set G such that, for x, y ∈ G, the pair (x, y) is an arc if and only if yx−1 ∈ S. Further, if S = S−1 := {s−1|s ∈ S}, then Γ is undirected. Γ is conected if and only if G = 〈s〉. A Cayley (di)graph Γ = Cay(G,S) is called normal if the right regular representation of G is a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2008

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2006.12.001